11 、发表文章摘要 1 ) 一种求解装箱问题的混合算法 装箱问题( bin packing problem, bpp )是一类重要的组合优化问题,在现实生活中有着广泛的应用背景,特别在现代物流中,许多问题都抽象化为装箱问...
基于38个网页-相关网页
此外也将针对物件分群优化问题中的装箱问题(Bin Packing Problem, BPP)开发名为WFADOS (WFA Discrete Optimization System) 的雏型系...
基于2个网页-相关网页
one dimensional bin packing problem 一维装箱条码问题
Typical combinatorial optimization problems include Travelling Salesman Problem, Knapsack Problem, Bin Packing Problem, Minimum Degree Spanning Tree Problem, Set Cover Problem, etc. These problems are seemingly simple, and closely related to engineering situations.
典型的组合优化问题有旅行商问题、背包问题、装箱问题、最小度生成树问题、集合覆盖问题等。
参考来源 - 若干组合优化问题的算法研究·2,447,543篇论文数据,部分数据来源于NoteExpress
以上来源于: WordNet
The experiment indicates the validity of the TS to the three dimensional bin packing problem with multi-type bins.
实验结果表明了提出的禁忌算法对优化多箱型三维装箱问题的有效性。
The bin packing problem is to put some objects with various sizes into a defined space in order to obtain the specified optimal benefit.
装箱问题就是将不同尺寸的物品摆放入有一定容量的容器中,以获得某种最佳的效益。
As one of the constrained bin packing problem (BPP), coloring BPP has many important applications such as multi-processor real-time scheduling, etc.
作为经典装箱问题的推广,有色装箱问题在多处理器实时计算机系统的任务调度等实际问题中有着很强的应用背景。
应用推荐